Completion-based computation of least common subsumers with limited role-depth for EL and Prob-EL
نویسنده
چکیده
The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this report we present an algorithm for computing role-depth bounded EL-lcs based on the completion algorithm for EL. We extend this computation algorithm to a recently introduced probabilistic variant of EL: Prob-EL.
منابع مشابه
Role-depth Bounded Least Common Subsumers by Completion for EL- and prob-EL-TBoxes
The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this paper we present an algorithm for computing role-depth bounded EL-lcs based on the completion algorithm for EL. We extend this computation algorithm to a recently introduced probabilistic variant of EL: Prob-EL.
متن کاملRole-depth Bounded Least Common Subsumer in Prob-EL with Nominals
Completion-based algorithms can be employed for computing the least common subsumer of two concepts up to a given role-depth, in extensions of the lightweight DL EL. This approach has been applied also to the probabilistic DL Prob-EL, which is variant of EL with subjective probabilities. In this paper we extend the completion-based lcscomputation algorithm to nominals, yielding a procedure for ...
متن کاملCompletion-based computation of most specific concepts with limited role-depth for EL and Prob-EL
In Description Logics the reasoning service most specific concept (msc) constructs a concept description that generalizes an ABox individual into a concept description. For the Description Logic EL the msc may not exist, if computed with respect to general EL-TBoxes or cyclic ABoxes. However, it is still possible to find a concept description that is the msc up to a fixed role-depth, i.e. with ...
متن کاملRole-depth Bounded Least Common Subsumers for EL+ and ELI
For EL the least common subsumer (lcs) need not exist, if computed w.r.t. general TBoxes. In case the role-depth of the lcs concept description is bounded, an approximate solution can be obtained. In this paper we extend the completion-based method for computing such approximate solutions to ELI and EL+. For ELI the extension needs to be able to treat complex node labels. For EL+ a naive method...
متن کاملImplementing Completion-Based Inferences for the EL-family
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the case, if inverse roles are admitted. In this paper we present an optimized version of the completion algorithm for ELHIfR+ [11], which is implemented in jCel. The completion sets computed during classification are a goo...
متن کامل